Two-Step Greedy Algorithm for Reduced Order Quadratures
نویسندگان
چکیده
منابع مشابه
Two-step greedy algorithm for reduced order quadratures
We present an algorithm to generate application-specific, global reduced order quadratures (ROQ) for multiple fast evaluations of weighted inner products between parameterized functions. If a reduced basis (RB) or any other projection-based model reduction technique is applied, the dimensionality of integrands is reduced dramatically; however, the cost of approximating the integrands by project...
متن کاملReduced-Order Greedy Controllability of Finite Dimensional Linear Systems
Often a dynamical system is characterized by one or more parameters describing physical features of the problem or geometrical configurations of the computational domain. As a consequence, by assuming that the system is controllable, a range of optimal controls exists corresponding to different parameter values. The goal of the proposed approach is to avoid the computation of a control function...
متن کاملA greedy algorithm for the two-level nested logit model
We consider the assortment optimization problem under the classical two-level nested logit model. We establish a necessary and sufficient condition for the optimal assortment and develop a simple and fast greedy algorithm that iteratively removes at most one product from each nest to compute an optimal solution.
متن کاملA Two-Step Certified Reduced Basis Method
In this paper we introduce a two-step Certified Reduced Basis (RB) method. In the first step we construct from an expensive finite element “truth” discretization of dimension N an intermediate RB model of dimension N N . In the second step we construct from this intermediate RB model a derived RB (DRB) model of dimension M ≤ N . The construction of the DRB model is effected at cost O(N) and in ...
متن کاملHigh-order quadratures for the solution of scattering problems in two dimensions
1 We construct an iterative algorithm for the solution of forward scattering problems in two dimensions. The scheme is based on the combination of high-order quadrature formulae, fast application of integral operators in Lippmann-Schwinger equations, and the stabilized biconjugate gradient method (BI-CGSTAB). While the FFT-based fast application of integral operators and the BI-CGSTAB for the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2013
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-013-9722-z